北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2012, Vol. 35 ›› Issue (3): 103-107.doi: 10.13190/jbupt.201203.103.huiw

• 研究报告 • 上一篇    下一篇

内容分发网络中资源感知的服务节点选择问题

惠雯1,2,林闯2,杨扬1   

  1. 1 北京科技大学 计算机与通信工程学院, 北京 100083; 2 清华大学 计算机科学与技术系, 北京 100084
  • 收稿日期:2011-05-23 修回日期:2011-10-24 出版日期:2012-06-28 发布日期:2012-02-29
  • 通讯作者: 惠雯 E-mail:hwen97@126.com
  • 作者简介:惠雯(1982-),女,博士生,E-mail:hwen@126.com 林闯(1948-),男,教授,博士生导师
  • 基金资助:

    国家自然科学基金项目(60932003);国家重点基础研究发展计划项目(2010CB328105)

Resource-Aware Server Selection in Content Delivery Networks

HUI Wen1,2,LIN Chuang2,YANG Yang1   

  1. 1 School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China;
    2 Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
  • Received:2011-05-23 Revised:2011-10-24 Online:2012-06-28 Published:2012-02-29

摘要:

提出了一种在内容分发网络中选取最优服务节点的方法. 该方法权衡了服务性能和服务开销,根据实时测量的网络状况和服务节点工作状态,利用网络坐标方法预测服务开销,同时在网络坐标空间中,利用分层聚类思想组织各服务节点,使用户请求能在保证服务性能的前提下,自适应地定位到开销最小的服务节点. 实验结果表明,该方法可有效提高资源定位准确度,减少服务开销且具有较好的时间特性.

关键词: 内容分发网络, 资源定位, 分层聚类, 网络坐标

Abstract:

In order to solve the problem of resource location in content delivery networks, a new algorithm for selecting optimal service nodes is proposed. The algorithm provides a good solution for both service performance and overhead. First, by taking advantage of the network coordinates approach, the computation and communication overhead of different service nodes are computed depending on network and server status change. Then, based on the hierarchical clustering algorithm, all the service nodes are reorganized in the coordinate space. Finally, the user requests are adaptively redirected to the service nodes with minimum overhead without sacrificing the service performance. Experiments verified that the precision of resource location is improved and the overhead is reduced with acceptable time performance by the new algorithm.

Key words: content delivery network, resource location, hierarchical clustering, network coordinate

中图分类号: